A Gradient-Based Interior-Point Method to Solve the Many-to-Many Assignment Problems
نویسندگان
چکیده
منابع مشابه
A Lagrangian bound for many-to-many assignment problems
A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a...
متن کاملTailoring Many-Body Interactions to Solve Hard Combinatorial Problems
A quantum search machine consisting of interacting linear clusters of atoms is proposed to solve the 3SAT problem. Each cluster with two relevant states of collective motion can be used to register a Boolean variable. Given any 3SAT Boolean formula the interactions among the clusters can be so tailored that the ground state(s) (possibly degenerate) of the whole system encodes the satisfying tru...
متن کاملa model to solve project scheduling and staff assignment problems
the allocation of human resources to project activities in order to schedule them is one of the closest states to the actual conditions of scheduling problems. but regarding the fact that this problem belongs to the class of np-hard problems; so far the exact methods have only been able to solve the small size problems. in this study, the renewable resources are humans in a way that every staff...
متن کاملTruthful Many-to-Many Assignment with Private Weights
This paper is devoted to the study of truthful mechanisms without payment for the many-to-many assignment problem. Given n agents and m tasks, a mechanism is truthful if no agent has an incentive to misreport her values on the tasks (agent ai reports a score wij for each task tj). The one-to-one version of this problem has already been studied by Dughmi and Ghosh [4] in a setting where the weig...
متن کاملEfficient Many-To-Many Point Matching in One Dimension
[email protected] 2 Department of Computer Science, Villanova University, Villanova, USA. e-mail: [email protected] 3 Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain. Partially supported by projects MCYT BFM2003-00368, MEC MTM2006-01267 and Gen. Cat. 2005SGR00692. e-mail: [email protected] 4 Chercheur qualifié du FNRS, Département d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2019
ISSN: 1076-2787,1099-0526
DOI: 10.1155/2019/8405036